Proving "no Cliques" in a Protocol
نویسنده
چکیده
The actual trend in the transport industry is to have electronic systems without mechanical back-up, so-called ”bywire” systems. Micro-computers control steering, brakes, power train etc... Robust protocols are needed to make these micro-computers communicate. They should be faulttolerant and yet not let the micro-computers split into disjoint communicating subsets. TTP is a time-triggered protocol that has been proposed for the automotive industry. In this paper we investigate the clique avoidance mechanism of TTP/C, the last version of TTP, and prove that it is effective.
منابع مشابه
Cliques Role in Organizational Reputational Influence: A Social Network Analysis
Empirical support for the assumption that cliques are major determinants of reputational influence derives largely from the frequent finding that organizations which claimed that their cliques’ connections are influential had an increased likelihood of becoming influential themselves. It is suggested that the strong and consistent connection in cliques is at least partially responsible for the ...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملEvaluation of a BIBD Based Directional MAC Protocol for Wireless Ad Hoc Networks
The use of directional antennas in wireless ad hoc networks can significantly improve global performance due to a high spatial channel reuse. Nevertheless, its introduction poses new location dependent problems related to the MAC protocol. In this paper, the Balanced Incomplete Block Design theory has been exploited to develop a new MAC protocol for wireless ad hoc networks using directional ant...
متن کاملOn Cliques in Spanning Graphs of Projective Steiner Triple Systems
We are interested in what sizes of cliques are to be found in any arbitrary spanning graph of a Steiner triple system S. In this paper we investigate spanning graphs of projective Steiner triple systems, proving, not surprisingly, that for any positive integer k and any sufficiently large projective Steiner triple system S, every spanning graph of S contains a clique of size k.
متن کاملHitting all maximum cliques with a stable set using lopsided independent transversals
Rabern recently proved that any graph with ω ≥ 3 4(∆+1) contains a stable set meeting all maximum cliques. We strengthen this result, proving that such a stable set exists for any graph with ω > 23(∆ + 1). This is tight, i.e. the inequality in the statement must be strict. The proof relies on finding an independent transversal in a graph partitioned into vertex sets of unequal size.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001